Strict/Tolerant Logics Built Using Generalized Weak Kleene Logics
نویسندگان
چکیده

 This paper continues my work of [9], which showed there was a broad family many valued logics that have strict/tolerant counterpart. Here we consider generalization weak Kleene three logic, instead the strong version background for earlier work. We explain intuition behind generalization, then determine subclass structures in logic produces same results did. provides much background, but is not self-contained. Some from [9] are called on, and reproved here.
 Melvin C. Fitting. “A Family Strict/Tolerant Logics”. In: Journal Philosophical Logic (2020). Online. Print publication forthcoming.
منابع مشابه
Kleene Algebras, Regular Languages and Substructural Logics
We introduce the two substructural propositional logics KL, KL, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof. We also prove strong completeness for language models, where each logic comes with a different interpretation. We show that for both logics the...
متن کاملNon-associative Kleene Algebra and Temporal Logics
In earlier papers we have presented algebraic semantics of CTL and CTL*. However, they were not fully satisfactory. In particular, the treatment of the iteration operators U (“Until”) and W (“While”) employed ad-hoc definitions with general recursion, and their interrelation in CTL* and CTL was not set up in a very algebraic way. In this paper we use a new operator with which U and W can be des...
متن کاملWeak Nonmonotonic Probabilistic Logics
We present an approach where probabilistic logic is combined with default reasoning from conditional knowledge bases in Kraus et al.’s System P , Pearl’s System Z, and Lehmann’s lexicographic entailment. The resulting probabilistic generalizations of default reasoning from conditional knowledge bases allow for handling in a uniform framework strict logical knowledge, default logical knowledge, ...
متن کاملWeak subintuitionistic logics
A system WF of subintuitionistic logic is introduced, weaker than Corsi’s basic subintuitionistic system F. A derivation system with and without hypotheses is given in line with the authors’ derivation system for F. A neighborhood semantics is introduced with a somewhat more complex definition than the neighborhood semantics for non-normal modal logics. Completeness is proved for WF with respec...
متن کاملModeling generalized implicatures using non-monotonic logics
This paper reports on an approach tomodel generalized implicatures using nonmonotonic logics. The approach, called compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic logics in order to model the defeasibility of generalized i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Australasian Journal of Logic
سال: 2021
ISSN: ['1448-5052']
DOI: https://doi.org/10.26686/ajl.v18i2.6722